Testing Timed Finite State Machines with Guaranteed Fault Coverage
نویسندگان
چکیده
A method is presented for deriving test suites with the guaranteed fault coverage for deterministic possibly partial Timed Finite State Machines (TFSMs). TFSMs have integer boundaries for time guards and the time reset operation at every transition; for TFSM implementations the upper bound on the number of states is known as well as the largest finite boundary and the smallest duration of time guards. We consider two fault models and present corresponding techniques for deriving complete test suites. In the first fault model inputs can be applied at integer time instances while in the second fault model time instances can be rational. The derivation method for integer time instances is extended to the case when the number of states of an implementation under test can be larger than the number of states of the given specification.
منابع مشابه
Deriving Test Suites for Timed Finite State Machines
This paper is devoted to the derivation of distinguishing sequences for timed Finite State Machines (FSM). Such distinguishing sequences are used when deriving a test suite for a timed FSM with the guaranteed fault coverage.
متن کاملDistinguing Non-deterministic Timed Finite State Machines
Conformance testing with the guaranteed fault coverage is based on distinguishing faulty system implementations from the corresponding system specification. We consider timed systems modeled by timed possibly nondeterministic finite state machines (TFSMs) and propose algorithms for distinguishing two TFSMs. In particular, we present a preset algorithm for separating two separable TFSMs and an a...
متن کاملSelf-timed is self-checking
Self-checking circuits detect (at least some of) their own faults. We describe self-timed circuits, including combinational logic and sequential machines, which either halt or generate illegal output if they include any single stuck-at faults. The self-timed circuits employ dual rail data encoding to implement ternary logic of 0, 1, and unde f ined states; the fourth state is used to signal ill...
متن کاملTest Generation for a System of Communicating Finite State Machines
A system of communicating finite state machines (SCFSM) is a usual design model of a complicated system composed of multiple communicating components. SCFSM testing usually depends on finite state machine (FSM) testing as an SCFSM can be converted to an equivalent FSM. SCFSM testing, however, should consider the properties of SCFSMs which are different from those of component FSMs. This paper p...
متن کاملImproving fault coverage and minimising the cost of fault identification when testing from finite state machines
Software needs to be adequately tested in order to increase the confidence that the system being developed is reliable. However, testing is a complicated and expensive process. Formal specification based models such as finite state machines have been widely used in system modelling and testing. In this PhD thesis, we primarily investigate fault detection and identification when testing from fin...
متن کامل